Genetic Symbiosis Algorithm for Multiobjective Optimization Problems

A Genetic Algorithm for Multiobjective Structural Optimization

A genetic algorithm for multiobjective optimization is presented which tries to evolve an evenly distributed set of solutions belonging to the Pareto set by: (i) ranking the population according to nondomination properties; (ii) defining a filter to retain Pareto set solutions and (iii) using adequate operators: exclusion, addition and single-objective operator which improves the individuals fr...

A Micro-Genetic Algorithm for Multiobjective Optimization

An Elitist Genetic Algorithm for Multiobjective Optimization

Solving multiobjective engineering problems is a very difficult task due to, in general, in these class of problems, the objectives conflict across a high-dimensional problem space. In these problems, there is no single optimal solution, the interaction of multiple objectives gives rise to a set of efficient solutions, known as the Pareto-optimal solutions. During the past decade, Genetic Algor...

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

Benson's algorithm for nonconvex multiobjective problems via nonsmooth Wolfe duality

‎In this paper‎, ‎we propose an algorithm to obtain an approximation set of the (weakly) nondominated points of nonsmooth multiobjective optimization problems with equality and inequality constraints‎. ‎We use an extension of the Wolfe duality to construct the separating hyperplane in Benson's outer algorithm for multiobjective programming problems with subdifferentiable functions‎. ‎We also fo...